Sliding window based CAC for adaptive service in mobile network

The CAC algorithm of mobile network is responsible for reducing the handoff drop ratio(HDR) to an acceptable low level as well as achieving a high accept ratio for locally generated calls. Algorithms based on dynamic resource reservation depend on complex measurement, calculation and information exchange between cells. Recently, adaptive service has been proposed to protect the QoS of mobile users and increase the capacity of mobile network. A new sliding window based CAC algorithm specially designed for adaptive service is introduced in this paper. This algorithm can avoid the complex estimation of the handoff probability in dynamic algorithm, and simulation results show that this algorithm can reduce the HDR to nearly zero and can also get a higher accept ratio than dynamic algorithm.